Exponential Lower Bounds and Separation for Query Rewriting
نویسندگان
چکیده
We establish connections between the size of circuits and formulas computing monotone Boolean functions and the size of firstorder and nonrecursive Datalog rewritings for conjunctive queries over OWL2QL ontologies. We use known lower bounds and separation results from circuit complexity to prove similar results for the size of rewritings that do not use non-signature constants. For example, we show that, in the worst case, positive existential and nonrecursive Datalog rewritings are exponentially longer than the original queries; nonrecursive Datalog rewritings are in general exponentially more succinct than positive existential rewritings; while first-order rewritings can be superpolynomially more succinct than positive existential rewritings.
منابع مشابه
Counting of Query Expressions: Limitations of Propositional Methods
Query evaluation in tuple-independent probabilistic databases is the problem of computing the probability of an answer to a query given independent probabilities of the individual tuples in a database instance. There are two main approaches to this problem: (1) in grounded inference one first obtains the lineage for the query and database instance as a Boolean formula, then performs weighted mo...
متن کاملCapacity Bounds and High-SNR Capacity of the Additive Exponential Noise Channel With Additive Exponential Interference
Communication in the presence of a priori known interference at the encoder has gained great interest because of its many practical applications. In this paper, additive exponential noise channel with additive exponential interference (AENC-AEI) known non-causally at the transmitter is introduced as a new variant of such communication scenarios. First, it is shown that the additive Gaussian ch...
متن کاملExponential Lower Bound for 2-Query Locally Decodable Codes
We prove exponential lower bounds on the length of 2-query locally decodable codes. Goldreich et al. recently proved such bounds for the special case of linear locally decodable codes. Our proof shows that a 2-query locally decodable code can be decoded with only 1 quantum query, and then proves an exponential lower bound for such 1-query locally quantum-decodable codes. We also exhibit q-query...
متن کاملModel Counting of Query Expressions: Limitations of Propositional Methods∗
Query evaluation in tuple-independent probabilistic databases is the problem of computing the probability of an answer to a query given independent probabilities of the individual tuples in a database instance. There are two main approaches to this problem: (1) in grounded inference one first obtains the lineage for the query and database instance as a Boolean formula, then performs weighted mo...
متن کاملA Practical Algorithm for Reformulation of Deductive Databases
Database Reformulation is the process of rewriting the data and rules in deductive databases in a functionally equivalent manner, ideally in ways that decrease query processing time while keeping storage costs within acceptable bounds. Early research in this area focussed on materializing existing views, i.e. caching those views as data. Subsequent research extended this work to the problem of ...
متن کامل